Analytical bounds for damage induced planar anisotropy
نویسندگان
چکیده
منابع مشابه
Diameter bounds for planar graphs
The inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. We prove that in any connected planar graph, the diameter is at most 5/2 times the inverse degree, and that this ratio is tight. To develop a crucial surgery method, we begin by proving the simpler related upper bounds (4(|V | − 1) − |E|)/3 and 4|V |2/3|E| on the diameter (for connected planar graphs), w...
متن کاملClass 1 bounds for planar graphs
There are planar class 2 graphs with maximum vertex-degree k, for each k ∈ {2, 3, 4, 5}. In 1965, Vizing proved that every planar graph with ∆ ≥ 8 is class 1. He conjectured that every planar graph with ∆ ≥ 6 is a class 1 graph. This conjecture is proved for ∆ = 7, and still open for ∆ = 6. Let k ≥ 2 and G be a k-critical planar graph. The average face-degree F (G) of G is 2 |F (G)| |E(G)|. Let...
متن کاملFace-Degree Bounds for Planar Critical Graphs
The only remaining case of a well known conjecture of Vizing states that there is no planar graph with maximum degree 6 and edge chromatic number 7. We introduce parameters for planar graphs, based on the degrees of the faces, and study the question whether there are upper bounds for these parameters for planar edge-chromatic critical graphs. Our results provide upper bounds on these parameters...
متن کاملBounds for sparse planar and volume arrays
This correspondence improves and extends bounds on the numbers of sensors, redundancies, and holes for sparse linear arrays to sparse planar and volume arrays. As an application, the efficiency of regular planar and volume arrays with redundancies but no holes is deduced. Also, examples of new redundancy and hole square arrays, found by exhaustive computer search, are given.
متن کاملLower Bounds for Planar Electrical Reduction
We improve our earlier lower bounds on the number of electrical transformations required to reduce an n-vertex plane graph in the worst case [SOCG 2016] in two different directions. Our previous Ω(n3/2) lower bound applies only to facial electrical transformations on plane graphs with no terminals. First we provide a stronger Ω(n2) lower bound when the graph has two or more terminals, which fol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Solids and Structures
سال: 2015
ISSN: 0020-7683
DOI: 10.1016/j.ijsolstr.2015.02.017